Sustainable optimization of waste management network over extended planning time horizon

This study proposes a multiperiod mixed integer linear programming model for the management of a single municipal solid waste (MSW) treatment plant with sustainability as the objective. Discrete and continuous variables define the capacity selections for diverse MSW technologies, and the operation of the MSW network, respectively. The economic target is considered to maximize the net present value. The environmental impact is the minimization of a normalized environmental objective function (NEOF). The social target is the maximization of jobs. An interesting feature about the research work is the requirement of biodrying technologies for MSW moisture content control. Due to the conflicted nature among the sustainability components, a multiobjective optimization (MO) is carried out to find the Pareto optimal solutions. The MO results show that the Pareto optimal solutions vary around profit range of $4.9–8.5 billion, NEOF impact range of 3.2–3.6 units, and social benefit range of 2700–4828 jobs.     

An efficient approach for the S‐shaped penalty function

Interval goal programming (IGP) with a marginal penalty function (PF) was first proposed by Charnes and Collomb in 1972, and further improved by Kvanli and other researchers. Recently, Lu and Chen proposed an efficient logarithmic method to formulate IGP with an S‐shaped PF. However, their method requires adding many binary variables when the problem size becomes large, which increases the computational burden in the solution process. This study proposes an efficient approach for the S‐shaped PF. The arbitrary PF frequently appears in the fields of business and industry. However, none of the previous approaches have addressed arbitrary PFs without adding binary variables. The proposed approach can be easily extended to formulate an arbitrary PF in which binary variables are no longer required, regardless of the number of break points. The proposed method can improve the efficiency of IGP for solving large size management and decision problems in considering PFs. In order to demonstrate the correctness, usefulness of the proposed model, illustrative examples are provided.     

Prediction of mode I fracture toughness of rock using linear multiple regression and gene expression programming

Prediction of mode I fracture toughness (K_IC) of rock is of significant importance in rock engineering analyses. In this study, linear multiple regression (LMR) and gene expression programming (GEP) methods were used to provide a reliable relationship to determine mode I fracture toughness of rock. The presented model was developed based on 60 datasets taken from the previous literature. To predict fracture parameters, three mechanical parameters of rock mass including uniaxial compressive strength (UCS), Brazilian tensile strength (BTS), and elastic modulus (E) have been selected as the input parameters. A cluster of data was collected and divided into two random groups of training and testing datasets. Then, different statistical linear and artificial intelligence based nonlinear analyses were conducted on the training data to provide a reliable prediction model of K_IC. These two predictive methods were then evaluated based on the testing data. To evaluate the efficiency of the proposed models for predicting the mode I fracture toughness of rock, various statistical indices including coefficient of determination (R²), root mean square error (RMSE), and mean absolute error (MAE) were utilized herein. In the case of testing datasets, the values of R², RMSE, and MAE for the GEP model were 0.87, 0.188, and 0.156, respectively, while they were 0.74, 0.473, and 0.223, respectively, for the LMR model. The results indicated that the selected GEP model delivered superior performance with a higher R² value and lower errors.     

基于改进LFM算法的主动解列断面搜索方法

针对传统解列断面算法复杂度高的问题,提出一种基于改进LFM算法的解列断面搜索方式。首先,基于节点间电气联系和能量转移分布熵完成电网加权复杂网络建模;其次,基于主动解列断面约束条件,对LFM算法做适应性改良;最后,通过改进LFM算法得到解列断面,并在IEEE39节点系统中验证了算法有效性。仿真结果表明,改进LFM算法可充分考虑传统解列断面的约束条件,在算法具有较低复杂度的同时对系统运行状态更强的适应性。     

Decentralized optimal tracking control for large-scale nonlinear systems with tracking error constraints

In this article, a decentralized optimal tracking control strategy is proposed for a class of nonlinear systems with tracking error constraints by utilizing adaptive dynamic programming (ADP). It should be noted that ADP technology cannot be directly used to solve decentralized optimal tracking problem of large-scale interconnected nonlinear system with nonzero equilibrium points, since that an infinite domain performance index function may result in an unsolvable solution. In addition, by introducing a smooth function, the constrained tracking error is transformed into an unconstrained one. Then, the error dynamics and a new infinite domain performance index function are designed, such that ADP technology can be used. Following the designed performance index function, the tracking error can be ensured within a small neighborhood of zero. Finally, the feasibility and the effectiveness of the proposed decentralized optimal control scheme are verified through two simulation examples.     

Governance of institutional complexity in megaproject organizations

A significant research gap exists in our understanding of how to govern institutional complexity in megaproject organizations. In this paper, we conduct a case study of the Hong Kong-Zhuhai-Macao Bridge project in order to elaborate on whence institutional complexity emerges and how institutional complexity affects project outcomes and shapes actors' behaviors. We find that institutional complexity stems from both external (macro-level) environments and internal actors (micro-level environments), and consists of regulatory, political, and social complexity and cultural, evolutionary, and relational complexity, respectively. In addition, we find that institutional complexity from the macro environments will result in constraint conflicts in megaproject organizations, whereas the different practices and identities of the project's various micro-actors will create organizational conflicts. We also find that actors within the megaproject organizations choose different responses when faced with different types of institutional complexity. Our approach offers conceptual refinements and a new sensitizing framework for guiding studies of how, in practice, to govern institutional complexity of megaproject organizations.